Partitions of unity and coverings
نویسندگان
چکیده
منابع مشابه
Partitions of Unity and Approximation
We show that for certain translation invariant spaces 5, a necessary and sufficient condition for the eventual denseness of the corresponding scaled spaces Sh is that S contain a stable and locally supported partition of unity. These results have been motivated by recent work on approximation by multivariate piecewise polynomials on regular meshes.
متن کاملCore partitions and block coverings
A number of new results about core partitions have been proved recently. ([2],[3], [9], [12]) For s ∈ N an s-core is by definition an integer partition without hooks of length s. This type of partitions first occurred in modular representation theory of symmetric groups, where s-cores label s-blocks of defect 0 in the case where s is a prime. In the study of relations between blocks for differe...
متن کاملClique partitions and clique coverings
Several new tools are presented for determining the number of cliques needed to (edge-)partition a graph . For a graph on n vertices, the clique partition number can grow cn z times as fast as the clique covering number, where c is at least 1/64. If in a clique on n vertices, the edges between en° vertices are deleted, Z--a < 1, then the number of cliques needed to partition what is left is asy...
متن کاملClique coverings and partitions of line graphs
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique in C. The clique covering (partition) number cc(G) (cp(G)) of G is the minimum size of a clique covering (partition) of G. This paper gives alternative proofs, using a unified approach, for the results on the clique c...
متن کاملOn pseudo-convex decompositions, partitions, and coverings
We introduce pseudo-convex decompositions, partitions, and coverings for planar point sets. They are natural extensions of their convex counterparts and use both convex polygons and pseudo-triangles. We discuss some of their basic combinatorial properties and establish upper and lower bounds on their complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2014
ISSN: 0166-8641
DOI: 10.1016/j.topol.2014.05.015